Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
191	Structural Filtering A Paradigm for EÆcient and Exact Geometric Programs Stefan Funke Kurt Mehlhorny Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:00:19 Quicksort Insertion sort Delaunay triangulation Algorithm Merge sort Randomized algorithm Time complexity Logarithm Factorial Mathematics Sorting algorithms Order theory
192	Computing Low Latency Batches with Unreliable Workers in Volunteer Computing Environments Eric M. Heien, Noriyuki Fujimoto, Kenichi Hagihara Graduate School of Information Science and Technology, Osaka University Toyonak Add to Reading List Source URL: www.heien.org Language: English - Date: 2011-02-16 09:55:36 Mathematics Analysis of algorithms Distributed computing Algorithm Scheduling Randomized algorithm Computational complexity theory Time complexity Theoretical computer science Applied mathematics Scheduling algorithms
193	CS 373: Combinatorial Algorithms, Spring 2001 Homework 1 (due Thursday, February 1, 2001 at 11:59:59 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:32 Algorithm Mathematical logic Theoretical computer science Randomized algorithm Factorial Dynamic programming XTR Fisher–Yates shuffle Mathematics Integer sequences Combinatorics
194	Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast Shlomi Dolev1 , Seth Gilbert2 , Majid Khabbazian3 , and Calvin Newport4 ? 1 Ben-Gurion University, Beersheba, Israel Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:03 Analysis of algorithms Information theory Probabilistic complexity theory Randomized algorithm Algorithm SL Time complexity Channel Theoretical computer science Computational complexity theory Applied mathematics
195	Carousel: Scalable Logging for Intrusion Prevention Systems Vinh The Lam† , Michael Mitzenmacher⋆ , George Varghese† † ⋆ University of California, San Diego Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2010-03-06 15:42:35 Computing Bloom filter Software Hash table Hash function Snort Randomized algorithm Trie Search algorithms Hashing Theoretical computer science
196	Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1997-12-08 20:38:05 Analysis of algorithms Computational geometry Probabilistic complexity theory Randomized algorithm Algorithm Time complexity Binary search algorithm LP-type problem Closest pair of points problem Theoretical computer science Applied mathematics Mathematics
197	Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Analysis of algorithms Bellman–Ford algorithm Time complexity Search algorithms Routing algorithms Koorde Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
198	Collaborative Scoring with Dishonest Participants Seth Gilbert Rachid Guerraoui EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Finite fields Analysis of algorithms Probabilistic complexity theory Randomized algorithm Chernoff bound IP Theoretical computer science Applied mathematics Mathematics
199	The Expected Optimal Labeling Order Problem for Crowdsourced Joins and Entity Resolution Jiannan Wang # , Guoliang Li # , Tim Kraska † , Michael J. Franklin ‡ , Jianhua Feng # # Department of Computer Science, Tsing Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2014-09-28 21:49:52 Randomized algorithm Mathematics Algorithm Crowdsourcing Computer science Applied mathematics Analysis of algorithms Probabilistic complexity theory
200	Chapter 12 Stabilization A large branch of research in distributed computing deals with fault-tolerance. Being able to tolerate a considerable fraction of failing or even maliciously behaving (“Byzantine”) nodes whi Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Mathematics Self-stabilization Randomized algorithm Search algorithms Routing algorithms Small world routing Superstabilization Theoretical computer science Computational complexity theory Fault-tolerant computer systems

UPDATE